Translating a convex polyhedron over monotone polyhedra

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unfolding Convex Polyhedra via Radially Monotone Cut Trees

A notion of “radially monotone” cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut is infinitesimally opened by the curvature at the vertices along the path. It is shown that a class of planar, triangulated convex domains always have a rad...

متن کامل

Algorithm and Software for Integration over a Convex Polyhedron

Wepresent a new efficient algorithm for numerical integration over a convex polyhedron in multi-dimensional Euclidian space defined by a system of linear inequalities. The software routines which implement this algorithm are described. A numerical example of calculating an integral using these routines is given.

متن کامل

Circumscribed sphere of a convex polyhedron

Suppose that K is a convex polyhedron in the n-dimensional Euclidean space R. Suppose that the extreme points of K are P1, P2, . . . , Pm ( m ≥ n + 1). If P is an arbitrary interior point of K, then there exist vertices Pi1 , Pi2 , . . . , Pin+1 of K and a point Q of R n and a positive number r > 0 for which ||Pik − Q|| = r for 1 ≤ k ≤ n + 1 , ||Pj − Q|| ≤ r for 1 ≤ j ≤ m and P is an interior p...

متن کامل

How to Cut out a Convex Polyhedron

It is known that one can fold a convex polyhedron from a non-overlapping face unfolding, but the complexity of the algorithm in [MP] remains an open problem. In this paper we show that every convex polyhedron P ⊂ R can be obtained in polynomial time, by starting with a cube which contains P and sequentially cutting out the extra parts of the surface. Our main tool is of independent interest. We...

متن کامل

A Topologically Convex Vertex-Ununfoldable Polyhedron

We construct a polyhedron that is topologically convex (i.e., has the graph of a convex polyhedron) yet has no vertex unfolding: no matter how we cut along the edges and keep faces attached at vertices to form a connected (hinged) surface, the surface necessarily unfolds with overlap.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 2002

ISSN: 0925-7721

DOI: 10.1016/s0925-7721(02)00098-6